Fairness for Infinite - State Systems October 20 , 2014 Byron
نویسندگان
چکیده
In this paper we introduce the first known tool for symbolically proving fair CTL properties of (infinite-state) integer programs. Our solution is based on a reduction to existing techniques for fairness-free CTL model checking via the use of infinite non-deterministic branching to symbolically partition fair from unfair executions. We show the viability of our approach in practice using examples drawn from device drivers and algorithms utilizing shared resources.
منابع مشابه
Fairness for Infinite-State Systems
In this paper we introduce the first known tool for symbolically proving fair -CTL properties of (infinite-state) integer programs. Our solution is based on a reduction to existing techniques for fairnessfree CTL model checking via the use of infinite non-deterministic branching to symbolically partition fair from unfair executions. We show the viability of our approach in practice using exampl...
متن کاملEfficient First-Order Temporal Logic for Infinite-State Systems
In this paper we consider the specification and verification of infinite-state systems using temporal logic. In particular, we describe parameterised systems using a new variety of first-order temporal logic that is both powerful enough for this form of specification and tractable enough for practical deductive verification. Importantly, the power of the temporal language allows us to describe ...
متن کاملFair Termination for Parameterized Probabilistic Concurrent Systems (Technical Report)
We consider the problem of automatically verifying that a parameterized family of probabilistic concurrent systems terminates with probability one for all instances against adversarial schedulers. A parameterized family defines an infinite-state system: for each number n, the family consists of an instance with n finite-state processes. In contrast to safety, the parameterized verification of l...
متن کاملFair Termination for Parameterized Probabilistic Concurrent Systems
We consider the problem of automatically verifying that a parameterized family of probabilistic concurrent systems terminates with probability one for all instances against adversarial schedulers. A parameterized family defines an infinite-state system: for each number n, the family consists of an instance with n finite-state processes. In contrast to safety, the parameterized verification of l...
متن کاملBranching-time reasoning for infinite-state systems
We introduce the first known automatic method for reasoning about branching-time for infinite-state systems. The key idea is to encode possible branching using recursion in a way that an interprocedural program analysis for infinite-state programs can then naturally perform the necessary operations needed for branchingtime proofs (e.g. backtracking, eventuality checking, tree counterexamples, e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014